A Simulation Preorder for Abstraction of Reactive Systems

نویسندگان

  • Ferucio Laurentiu Tiplea
  • Aurora Tiplea
چکیده

We present a simulation preorder for reactive systems modeled by fair Kripke structures whose transition relation is divided into two parts, internal and external. The first one models the internal behaviour of the system, while the second one is used to model the interaction with an environment. We show that our simulation preorder preserves a substantial subset of ∀CTL∗. Then, we present an abstraction technique for systems composed by multiple modules and we show that each such system is smaller in the simulation preorder than its “augmented” components. We illustrate our abstraction methodology by applying it to Petri net reactive systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rank-Based Simulation on Acyclic Graphs

The simulation preorder is widely used both as a behavioral relation in concurrent systems, and as an abstraction tool to reduce the state space in model checking, were memory requirement is clearly a critical issue. Therefore, in this context a simulation algorithm should address both time and space efficiency. In this paper, we rely on the notion of rank to design an efficient simulation algo...

متن کامل

Simultaneous Control of Active and Reactive Powers of Vanadium Redox Flow Battery Systems in Flexible Microgrids

This paper discusses the control of flexible microgrids, consisting of a Redox Flow Batteries (RFB) and a new power conditioning system (PCS) for the RFB. Considering the importance of energy storage, this study is essential in power systems that are developed cautiously. RFB is connected to power system by a DC/DC or DC/AC converter to produce a DC voltage. It is very important that this conve...

متن کامل

Simulation Preorder over Simple Process Algebras

We consider the problem of simulation preorder/equivalence between infinitestate processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulat...

متن کامل

Simulation for Continuous-Time Markov Chains

This paper presents a simulation preorder for continuoustime Markov chains (CTMCs). The simulation preorder is a conservative extension of a weak variant of probabilistic simulation on fully probabilistic systems, i.e., discrete-time Markov chains. The main result of the paper is that the simulation preorder preserves safety and liveness properties expressed in continuous stochastic logic (CSL)...

متن کامل

On the specification of modal systems: A comparison of three frameworks

This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders over labelled transition systems. It is shown that there are mutual translations between modal transition systems and labelled transition systems t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002